Robust Iteration-dependent Least Mean Square-based Distribution Static Compensator Using Optimized PI Gains
نویسندگان
چکیده
A robust iteration-dependent least mean square (RIDLMS) algorithm-based fundamental extractor is developed to estimate the components of load current for a four-wire DSTATCOM with nonlinear load. The averaging parameter calculating variable step size iteration dependent and uses tuning parameters. Rather than using value, previous learning rate was used in this method achieve more adaptive solution. This additional control factor aids determining exact rate, resulting reliable convergent outcomes. Its faster convergence avoidance local minima make it advantageous. estimation PI controller gains achieved through self-adaptive multi-population algorithm. change group number will increase exploration exploitation. nature algorithm determine subpopulation needed according fitness value. main advantage spread throughout search space better optimal estimated controllers are DC bus AC terminal voltage error minimization. RIDLMS-based obtained proposed optimization showed power quality performance. considered RIDLMS-supported demonstrated experimentally d-SPACE-1104.
منابع مشابه
Least Mean Square Algorithm
The Least Mean Square (LMS) algorithm, introduced by Widrow and Hoff in 1959 [12] is an adaptive algorithm, which uses a gradient-based method of steepest decent [10]. LMS algorithm uses the estimates of the gradient vector from the available data. LMS incorporates an iterative procedure that makes successive corrections to the weight vector in the direction of the negative of the gradient vect...
متن کاملLeast Mean Square Algorithm
The Least Mean Square (LMS) algorithm, introduced by Widrow and Hoff in 1959 [12] is an adaptive algorithm, which uses a gradient-based method of steepest decent [10]. LMS algorithm uses the estimates of the gradient vector from the available data. LMS incorporates an iterative procedure that makes successive corrections to the weight vector in the direction of the negative of the gradient vect...
متن کاملMean square convergence analysis for kernel least mean square algorithm
In this paper, we study the mean square convergence of the kernel least mean square (KLMS). The fundamental energy conservation relation has been established in feature space. Starting from the energy conservation relation, we carry out the mean square convergence analysis and obtain several important theoretical results, including an upper bound on step size that guarantees the mean square con...
متن کاملKernel Least Mean Square Algorithm
A simple, yet powerful, learning method is presented by combining the famed kernel trick and the least-mean-square (LMS) algorithm, called the KLMS. General properties of the KLMS algorithm are demonstrated regarding its well-posedness in very high dimensional spaces using Tikhonov regularization theory. An experiment is studied to support our conclusion that the KLMS algorithm can be readily u...
متن کاملDiffusion Least Mean Square: Simulations
In this technical report we analyse the performance of diffusion strategies applied to the Least-Mean-Square adaptive filter. We configure a network of cooperative agents running adaptive filters and discuss their behaviour when compared with a non-cooperative agent which represents the average of the network. The analysis provides conditions under which diversity in the filter parameters is be...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Chinese journal of electrical engineering
سال: 2022
ISSN: ['2096-1529']
DOI: https://doi.org/10.23919/cjee.2022.000040